Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems

نویسندگان

  • Adam Kasperski
  • Pawel Zielinski
چکیده

In this paper a general approach to combinatorial optimization problems with fuzzy weights is discussed. The results, valid for the interval-valued problems, are extended to the fuzzy-valued ones by exploiting the very recent notion of a gradual number. Some methods for determining the exact degrees of possible and necessary optimality and the possibility distributions of deviations of solutions and elements are proposed. The introduced notions are illustrated by practical examples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Fuzzy PERT Using Gradual Real Numbers

From a set of a partially ordered tasks, one goal of the project scheduling problem is to compute earliest starting dates, latest starting dates and floats of the different tasks, and to identify critical tasks. When durations of tasks are not precisely known, the problem is much trickier. Recently we provided polynomial algorithms to compute upper bound of activity floats in the interval-value...

متن کامل

A hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem

We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...

متن کامل

An interval-valued programming approach to matrix games with payoffs of triangular intuitionistic fuzzy numbers

The purpose of this paper is to develop a methodology for solving a new type of matrix games in which payoffs are expressed with triangular intuitionistic fuzzy numbers (TIFNs). In this methodology, the concept of solutions for matrix games with payoffs of TIFNs is introduced. A pair of auxiliary intuitionistic fuzzy programming models for players are established to determine optimal strategies...

متن کامل

On Solving Fuzzy Game Problem using Octagonal Fuzzy Numbers

In this paper, we consider a two persons zero sum game with imprecise values in payoff matrix. All the imprecise values are assumed to be octagonal fuzzy numbers. An approach for solving problems by using ranking of the fuzzy numbers has been considered to solve the fuzzy game problem. By using ranking to the payoffs we convert the fuzzy valued game problem to crisp valued game problem, which c...

متن کامل

Interactive multiple objective programming in optimization of the fully fuzzy quadratic programming problems

In this paper, a quadratic programming (FFQP) problem is considered in which all of the cost coefficients, constraints coefficients, and right hand side of the constraints are characterized by L-R fuzzy numbers. Through this paper, the concept of α- level of fuzzy numbers for the objective function, and the order relations on the fuzzy numbers for the constraints are considered.  To optimize th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007